fast direct awar proxim graph mine hanghang tong christo faloutso yehuda koren paper studi asymmetr proxim measur direct graph quantifi relationship node group node measur graph mine task includ cluster link predict connect subgraph discoveri proxim measur base conceptof escap probabl strive summar multipl facet node proxim avoid pitfal altern proxim measur suscept uniqu featur measur account underli direct inform put special emphasi comput effici develop fast solut applic set experiment studi show us propos direct awar proxim method applic algorithm achiev signific speedup straight forward implement 